An annotated overview of dynamic network flows

نویسنده

  • Balázs Kotnyek
چکیده

The need for more realistic network models led to the development of the dynamic network flow theory. In dynamic flow models it takes time for the flow to pass an arc, the flow can be delayed at nodes, and the network parameters, e.g., the arc capacities, can change in time. Surprisingly perhaps, despite being closer to reality, dynamic flow models have been overshadowed by the classical, static model. This is largely due to the fact that while very efficient solution methods exist for static flow problems, dynamic flow problems have proved to be more difficult to solve. Our purpose with this overview is to compensate for this eclipse and introduce dynamic flows to the interested reader. To this end, we present the main flow problems that can appear in a dynamic network, and review the literature for existing results about them. Our approach is solution oriented, as opposed to dealing with modelling issues. We intend to provide a survey that can be a first step for readers wondering whether a given dynamic network flow problem has been solved or not. Besides restating the problems, we also describe the main proposed solution methods. An additional feature of this paper is an annotated list of the most important references about the subject. Key-words: Flows, dynamic networks, time-dependent flows, algorithms, complexity This work was partially supported by the European FET project CRESSCO and the French CNRS AS Dynamo. I3S & INRIA Sophia Antipolis. The author received a scholarship from the European RTN project ARACNE. Un état de l’art commenté sur les réseaux de flots dynamiques Résumé : Un réseau de flots est dit dynamique si la traversée des arcs prend du temps, si le flot peut être retenu dans les nœuds, ou encore si les paramètres du réseau, par example, la capacité des arcs, peut évoluer au cours du temps. Dans ce rapport nous proposons un état de l’art des principaux problèmes liés aux réseaux de flots dynamiques, qui se veut une introduction au domaine. Nous y présentons les problèmes, les principales méthodes proposées pour les résoudre et nous fournissons une liste annotée des principales références bibliographiques sur le sujet. Mots-clés : Flots, résaux dynamiques, flots dynamiques, algorithmes, complexité An annotated overview of dynamic network flows 3

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Overview of Direct Numerical Simulation of Particle Entrainment in Turbulent Flows

An overview of removal and re-entrainment of particles in turbulent flows is presented. The procedure for the direct numerical simulation (DNS) of the Navier-Stokes equation via a pseudospectral method for simulating the instantaneous fluid velocity field is described. Particle removal mechanisms in turbulent flows in a duct are examined and effects of the near-wall coherent eddies on the parti...

متن کامل

"Technical Report" Performance Comparison of IHACRES Model and Artificial Neural Network to Predict the Flow of Sivand River

The accurate determination of river flow in watersheds without sufficient data is one of the major challenges in hydrology. In this regard, given the diversity of existing hydrological models, selection of an appropriate model requires evaluation of the performance of the hydrological models in each region. The objective of this study was to compare the performance of artificial neural network ...

متن کامل

User-based Vehicle Route Guidance in Urban Networks Based on Intelligent Multi Agents Systems and the ANT-Q Algorithm

Guiding vehicles to their destination under dynamic traffic conditions is an important topic in the field of Intelligent Transportation Systems (ITS). Nowadays, many complex systems can be controlled by using multi agent systems. Adaptation with the current condition is an important feature of the agents. In this research, formulation of dynamic guidance for vehicles has been investigated based...

متن کامل

Inverse Maximum Dynamic Flow Problem under the Sum-Type Weighted Hamming Distance

Inverse maximum flow (IMDF), is among the most important problems in the field ofdynamic network flow, which has been considered the Euclidean norms measure in previousresearches. However, recent studies have mainly focused on the inverse problems under theHamming distance measure due to their practical and important applications. In this paper,we studies a general approach for handling the inv...

متن کامل

Policy Model for Sharing Network Slices in 5G Core Network

As mobile data traffic increases, and the number of services provided by the mobile network increases, service load flows as well, which requires changing in the principles, models, and strategies for media transmission streams serving to guarantee the given nature of giving a wide scope of services in Flexible and cost-effective. Right now, the fundamental question remains what number of netwo...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003